Supporting distributed services in mobile ad hoc networks

As mobile dcviccs, such as laptops, PDAsor mobile phones, are getting more and morc ubiquitous and are able to directly cornmunicate with cach other via wireless technologies, the paradigrn 01' wirclcss Mobile Ad hoc NETworks (MANETs) is gaining popularity. Especially distributed real-time applications, Iike multiplayer garnes, group-work or multirnedia cntcrtainment, arc artractive for their users in this mohile ad hoc cnvironmcnt, However, MANETs impose new challenges becausc 01' their sclf-organizing, mobile and crror-pronc nature. Thus, provisioning distributed services in such an cnvironment is quite difficult, In this thesis, we focus on service managernent rclatcd issucs and design, develop, Implement and evaluate new mcchanisms, which can aid the efficient creation of appropriate service mauagcrncnt architccture for mobile ad hoc nctworks. Our contribution is thrcc-fold, First, we have designed and developcd an algorithm called PBS (Priority Based Selection) to help manage distributcd applications and support their smooth running in mobile ad hoc networks. PBS is based on graph theory and computes an appropriate Dorninating Set (DS) 01' thc nctwork graph in a Iully distributed mannet applying node priority. The nodes in the DS then ean be used as servers creating a robust, redundant client/server based service management architecture. Moreover, PBS is rhe first approach, according to our knowledge, in centrast to the existing DS computation algorithms that offers continuous maintenance 01' this set in dyriamically changing network topologies. 11 shows a stable performance even in case 01' high node mobility, keeping the DS computation time nearly constant, Second, we have designed and eleveloped a mechanisrn callcd NWC (Nodc Weight Cornputarion) 10be applied in nodc priority comparison which rcflects from the vicwpoint 01' a given scrvicc the node's available computation and